Unified Decision Procedures for Regular Expression Equivalence
نویسندگان
چکیده
We formalize a unified framework for verified decision procedures for regular expression equivalence. Five recently published formalizations of such decision procedures (three based on derivatives, two on marked regular expressions) can be obtained as instances of the framework. We discover that the two approaches based on marked regular expressions, which were previously thought to be the same, are different, and we prove a quotient relation between the automata produced by them. The common framework makes it possible to compare the performance of the different decision procedures in a meaningful way.
منابع مشابه
Computing Certificates of Regular Expression Equivalence
Deciding the equivalence of regular expressions is a fundamental problem of theoretical computer science. On one hand, there are several decision procedures to solve this problem. On the other hand, there are several axiomatisations of the equivalence of regular expression. The axiomatisations are proved to be complete and the proofs consists of showing that each steps of a decision procedure c...
متن کاملDecision Procedures for MSO on Words Based on Derivatives of Regular Expressions
Monadic second-order logic on finite words (MSO) is a decidable yet expressive logic into which many decision problems can be encoded. Since MSO formulas correspond to regular languages, equivalence of MSO formulas can be reduced to the equivalence of some regular structures (e.g. automata). We verify an executable decision procedure for MSO formulas that is not based on automata but on regular...
متن کاملFormalizing Symbolic Decision Procedures for Regular Languages
This thesis studies decision procedures for the equivalence of regular languages represented symbolically as regular expressions or logical formulas. Traditional decision procedures in this context rush to dispose of the concise symbolic representation by translating it into finite automata, which then are efficiently minimized and checked for structural equality. We develop procedures that avo...
متن کاملVerified Decision Procedures for MSO on Words
Monadic second-order logic on finite words (MSO) is a decidable yet expressive logic into which many decision problems can be encoded. Since MSO formulas correspond to regular languages, equivalence of MSO formulas can be reduced to the equivalence of some regular structures (e.g. automata). This paper presents a verified functional decision procedure for MSO formulas that is not based on autom...
متن کامل